Between 2- and 3-Colorability
نویسندگان
چکیده
We consider the question of the existence of homomorphisms between Gn,p and odd cycles when p = c/n, 1 < c ≤ 4. We show that for any positive integer l, there exists ε = ε(l) such that if c = 1 + ε then w.h.p. Gn,p has a homomorphism from Gn,p to C2l+1 so long as its odd-girth is at least 2l+1. On the other hand, we show that if c = 4 then w.h.p. there is no homomorphism from Gn,p to C5. Note that in our range of interest, χ(Gn,p) = 3 w.h.p., implying that there is a homomorphism from Gn,p to C3. These results imply the existence of random graphs with circular chromatic numbers χc satisfying 2 < χc(G) < 2 + δ for arbitrarily small δ, and also that 2.5 ≤ χc(Gn, 4 n ) < 3 w.h.p.
منابع مشابه
Tight Bounds on the Threshold for Permuted k-Colorability
If each edge (u, v) of a graph G = (V,E) is decorated with a permutation πu,v of k objects, we say that it has a permuted k-coloring if there is a coloring σ : V → {1, . . . , k} such that σ(v) 6= πu,v(σ(u)) for all (u, v) ∈ E. Based on arguments from statistical physics, we conjecture that the threshold dk for permuted k-colorability in random graphs G(n,m = dn/2), where the permutations on th...
متن کاملAlmost series-parallel graphs: structure and colorability
The series-parallel (SP) graphs are those containing no topological K 4 and are considered trivial. We relax the prohibition distinguishing the SP graphs by forbidding only embeddings of K4 whose edges with both ends 3-valent (skeleton hereafter) induce a graph isomorphic to certain prescribed subgraphs of K 4 . In particular, we describe the structure of the graphs containing no embedding of K...
متن کاملComplexity of the conditional colorability of graphs
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex v of degree d(v) in G is adjacent to vertices with at least min{r, d(v)} different colors. The smallest integer k for which a graph G has a conditional (k, r)-coloring is called the rth order conditional chromatic number, denoted by χr(G). It is easy to see that th...
متن کاملExact Complexity of Exact-Four-Colorability
Let Mk ⊆ N be a given set that consists of k noncontiguous integers. Define Exact-Mk-Colorability to be the problem of determining whether χ(G), the chromatic number of a given graph G, equals one of the k elements of the set Mk exactly. In 1987, Wagner [Wag87] proved that Exact-Mk-Colorability is BH2k(NP)-complete, where Mk = {6k + 1, 6k + 3, . . . , 8k − 1} and BH2k(NP) is the 2kth level of t...
متن کاملThe resolution complexity of random graph k-colorability
We consider the resolution proof complexity of propositional formulas which encode random instances of graph k-colorability. We obtain a tradeoff between the graph density and the resolution proof complexity. For random graphs with linearly many edges we obtain linear-exponential lower bounds on the length of resolution refutations. For any ǫ > 0, we obtain sub-exponential lower bounds of the f...
متن کاملSmall H-Coloring Problems for Bounded Degree Digraphs
An NP-complete coloring or homomorphism problem may become polynomial time solvable when restricted to graphs with degrees bounded by a small number, but remain NP-complete if the bound is higher. For instance, 3-colorability of graphs with degrees bounded by 3 can be decided by Brooks’ theorem, while for graphs with degrees bounded by 4, the 3-colorability problem is NP-complete. We investigat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015